A dynamic-symbolic interface for geometric theorem discovery

نویسندگان

  • Francisco Botana
  • José L. Valcarce
چکیده

This paper describes Discover, a program for learning and teaching geometry with the help of a computer. The program is a dynamic geometry environment that can communicate with Mathematica, using its symbolic capabilities to perform geometric discovery or rediscovery. Discover is specially suited to be used as a learning tool for geometry from the ages of 12 up to University. It permits the replacement of the traditional ruler and compass by electronic substitutes, as in standard dynamic geometry environments. Through its link with the computer algebra software, it enhances the process of conjecturing and proving. The results can be expressed in natural language or through the use of equations. The mathematical methods that Discover uses are sound, although not complete. Despite this last fact, almost all parts of the school curricula in plane geometry can be adequately treated with the program. # 2002 Elsevier Science Ltd. All rights reserved.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Connecting the 3D DGS Calques3D with the CAS Maple

Many (2D) Dynamic Geometry Systems (DGSs) are able to export numeric coordinates and equations with numeric coefficients to Computer Algebra Systems (CASs). Moreover, different approaches and systems that link (2D) DGSs with CASs, so that symbolic coordinates and equations with symbolic coefficients can be exported from the DGS to the CAS, already exist. Although the 3D DGS Calques3D can export...

متن کامل

Geometric Constraint Modeling, Data Quality and Software Integration

Geometric constraints are used for a variety of applications, like the representation of consistency conditions or the determination of geometric aspects. For many cases geometric constraints form a system of non-linear equations. For geometric constraint solving there are iterative and symbolic methods. Iterative approaches are easier to be implemented and often successful, while symbolic appr...

متن کامل

Dynamic Reductions for Model Checking Concurrent Software

Symbolic model checking of parallel programs stands and falls with effective methods of dealing with the explosion of interleavings. We propose a dynamic reduction technique to avoid unnecessary interleavings. By extending Lipton’s original work with a notion of bisimilarity, we accommodate dynamic transactions, and thereby reduce dependence on the accuracy of static analysis, which is a severe...

متن کامل

On the Unavoidable Uncertainty of Truth in Dynamic Geometry Proving

The aim of this note is to discuss some issues posed by the emergency of universal interfaces able to decide on the truth of geometric statements. More specifically, we consider a recent GeoGebra module allowing general users to verify standard geometric theorems. Working with this module in the context of Varignon’s theorem, we were driven – by the characteristics of the GeoGebra interface– to...

متن کامل

Towards Combining HTN Planning and Geometric Task Planning

In this paper we present an interface between a symbolic planner and a geometric task planner, which is different to a standard trajectory planner in that the former is able to perform geometric reasoning on abstract entities—tasks. We believe that this approach facilitates a more principled interface to symbolic planning, while also leaving more room for the geometric planner to make independe...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Computers & Education

دوره 38  شماره 

صفحات  -

تاریخ انتشار 2002